package 刷题10月.脑筋急转弯类型;
// https://leetcode-cn.com/problems/qiu-12n-lcof/
public class 剑指Offer64求1n1005 {
    class Solution {
        public int sumNums(int n) {
            boolean flag = n > 0 && (n += sumNums(n - 1)) > 0;
            return n;
        }
    }
}
